According to @deanmlittle, citing @cavemanloverboy on X, current MCP proposals would allow a low-latency participant in Hong Kong to read an outbound newswire and outbid a Singapore observer before the NYSE 50 ms auction merge rule orders transactions, effectively privileging newswire latency over direct event discovery; source: https://twitter.com/deanmlittle/status/2016332872077214079, source: https://x.com/cavemanloverboy/status/2016237694427529623. They assert that a leaderless algorithm like Hedera’s hashgraph would instead let the Singapore order win if its transaction propagates faster, because ordering follows network propagation rather than a centralized merge; source: https://x.com/cavemanloverboy/status/2016237694427529623. For traders, this positions MCP-style auctions as still susceptible to latency arbitrage, making execution priority hinge on connectivity and propagation paths, while leaderless consensus could reweight priority toward message propagation speed; source: https://twitter.com/deanmlittle/status/2016332872077214079. The post urges acknowledging the market design being built, highlighting implications for order fairness and auction design with relevance to HBAR and hashgraph discussions; source: https://twitter.com/deanmlittle/status/2016332872077214079.